On upper triangular block weak regular splittings of a singular M-matrix
نویسندگان
چکیده
منابع مشابه
Theorems on M-Splittings of a Singular M-Matrlx Which Depend on Graph Structure·
Let A = M N E IR nn be a splitting. We investigate the spectral properties of the iteration matrix M 1 N by considering the relationships of the graphs of A, M, N, and M1 N. We call a splitting an M-splitting if M is a nonsingular M-matrix and N;;. O. For an M-splitting of an irreducible Z-matrix A we prove that the circuit index of M1 N is the greatest common divisor of certain sets of integer...
متن کاملReduction of a Regular Matrix Pair (A, B) to Block Hessenberg Triangular Form
An algorithm for reduction of a regular matrix pair (A; B) to block Hessenberg-triangular form is presented. This condensed form Q T (A; B)Z = (H; T), where H and T are block upper Hessenberg and upper triangular, respectively, and Q and Z orthogonal, may serve as a rst step in the solution of the generalized eigenvalue problem Ax = Bx. It is shown how an elementwise algorithm can be reorganize...
متن کاملA Pseudorandom Bit Generator Based on Block Upper Triangular Matrices
The popularity of the Web has created a great marketplace for businesses to sell and showcase their products increasing the need for secure Web services such as SSL, TLS or SET. We propose a pseudorandom bit generator that can be used to create a stream cipher directly applicable to these secure systems; it is based on the powers of a block upper triangular matrix achieving great statistical re...
متن کاملa study on the effectiveness of textual modification on the improvement of iranian upper-intermediate efl learners’ reading comprehension
این پژوهش به منظور بررسی تأثیر اصلاح متنی بر بهبود توانایی درک مطلب زبان آموزان ایرانی بالاتر از سطح میانی انجام پذیرفت .بدین منظور 115 دانشجوی مرد و زن رشته مترجمی زبان انگلیسی در این پزوهش شرکت نمودند.
Mixing of the Upper Triangular Matrix Walk
We study a natural random walk over the upper triangular matrices, with entries in the field Z2, generated by steps which add row i + 1 to row i. We show that the mixing time of the lazy random walk is O(n) which is optimal up to constants. Our proof makes key use of the linear structure of the group and extends to walks on the upper triangular matrices over the fields Zq for q prime.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1996
ISSN: 0024-3795
DOI: 10.1016/0024-3795(94)00068-9